Levenshtein transition table
CANDIDATES | уводзі uvodzi BLR 🇧🇾 | въвежда vvežda BLG 🇧🇬 | zadává zadává CZE 🇨🇿 | wprowadza vprovadza POL 🇵🇱 | вводи vvodi RUS 🇷🇺 | zadáva zadáva SLK 🇸🇰 | вводи vvody UKR 🇺🇦 | TOTAL LEVENSHTEIN DISTANCE1 | MUTUAL INTELLIGIBILITY LOSS2 |
vvodi | 2 | 3 | 6 | 6 | 0 | 6 | 0.5 | 23.5 | 0.0 |
vvody | 2.5 | 3 | 6 | 6 | 0.5 | 6 | 0 | 24.0 | -0.5 |
uvodzi | 0 | 5 | 6 | 6 | 2 | 6 | 2.5 | 27.5 | -4.0 |
vvežda | 5 | 0 | 5.5 | 6 | 3 | 5 | 3 | 27.5 | -4.0 |
zadáva | 6 | 5 | 0.5 | 7 | 6 | 0 | 6 | 30.5 | -7.0 |
zadává | 6 | 5.5 | 0 | 7.5 | 6 | 0.5 | 6 | 31.5 | -8.0 |
vprovadza | 6 | 6 | 7.5 | 0 | 6 | 7 | 6 | 38.5 | -15.0 |
1TOTAL LEVENSHTEIN DISTANCE - Summarized count of letter replacements, insertions or deletions to convert the word into national words. The lower the better.
2MUTUAL INTELLIGIBILITY LOSS - Distance to the best candidate word (the best word has always 0.0 score).
Dictionary Index • Levenshtein Distance • Pravopis • Home
slovanto.eu